Predicate Construction in Higher-order Logic
نویسنده
چکیده
Predicate construction is a guided search process: a space of predicates must be enumerated in some systematic way in order to find, according to some criterion, a suitable predicate for some purpose. Often the search space is large and heuristics are used to guide the search. Typically, predicate construction is studied and implemented in the context of first-order logic. In this paper, I outline the foundations of predicate construction in higherorder logic. The main contribution is a method of incremental construction of predicates on higher-order terms that represent individuals. Applications of the approach to machine learning are indicated.
منابع مشابه
Higher-order illative combinatory logic
We show a model construction for a system of higher-order illative combinatory logic Iω, thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order intuitionistic predicate logic with second-order propositional quantifiers into the system I0 of Barendregt, Bunder and Dekkers, which gives a partial answer to a question pose...
متن کاملLearning Higher-Order Logic Programs through Abstraction and Invention
Many tasks in AI require the design of complex programs and representations, whether for programming robots, designing game-playing programs, or conducting textual or visual transformations. This paper explores a novel inductive logic programming approach to learn such programs from examples. To reduce the complexity of the learned programs, and thus the search for such a program, we introduce ...
متن کاملThe Theory of Form Logic
We investigate a construction schema for first-order logical systems, called “form logic”. Form logic allows us to overcome the dualistic commitment of predicate logic to individual constants and predicates. Dualism is replaced by a pluralism of terms of different “logical forms”. Individual form-logical systems are generated by the determination of a range of logical forms and of the formbased...
متن کاملAutomata Theory Approach to Predicate Intuitionistic Logic
Predicate intuitionistic logic is a well established fragment of dependent types. According to the Curry-Howard isomorphism proof construction in the logic corresponds well to synthesis of a program the type of which is a given formula. We present a model of automata that can handle proof construction in full intuitionistic first-order logic. The automata are constructed in such a way that any ...
متن کاملExtending models of second order predicate logic to models of second order dependent type theory
We describe a method for constructing a model of second order dependent type theory out of a model of classical second order predicate logic. Apart from the construction being of interest by itself, this also suggests a way of proving the completeness of the formulas-as-types embedding from second order predicate logic to second order dependent type theory. Under this embedding, formulas are in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electron. Trans. Artif. Intell.
دوره 4 شماره
صفحات -
تاریخ انتشار 2000